A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
نویسندگان
چکیده
منابع مشابه
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. We introduce new lower bounds and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. Computational results show that the proposed approach outperforms the best known proc...
متن کاملA Branch and Bound Procedure to Minimize Total Tardiness or Total Completion time on One Machine with Different Release Dates
In this paper, we present a Branch and Bound procedure to minimize total tardiness on one machine with different release dates. We introduce a new lower bound and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. We also show how we can generalize different techniques to minimize total completion...
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملA Branch-and-bound Algorithm for Single Machine Total Tardiness Problem with Release Dates
This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the perform...
متن کاملA branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines
The purpose of this paper is to propose a new branch-and-bound algorithm for a class of scheduling problems to minimize total tardiness on identical parallel machines. In this algorithm, Lagrangian relaxation technique is applied to obtain a tight lower bound. In addition, the job dominance conditions for the single machine total tardiness problem are utilized for both restricting branches and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2004
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(03)00378-3